Biform Analysis of Inventory Competition

نویسنده

  • Harborne W. Stuart
چکیده

T paper provides a model of the competitive newsvendor problem in which there is price competition following the inventory decisions. Using the biform game formalism of Brandenburger and Stuart (2004), the price competition is modeled by considering the core of the induced cooperative game. Such an analysis allows price competition to be modeled without a priori assumptions about price-setting power or pricing procedures. The paper shows that with no uncertainty, the inventory decision is equivalent to the capacity decision in Cournot competition. With uncertainty, the analysis again reduces to Cournot competition if the demand uncertainty is characterized by an appropriately constructed, expected demand curve. The results highlight the critical role of the fixed-price assumption in newsvendor models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biform Theories in Chiron

An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms. A biform theory is simultaneously an axiomatic theory and an algorithmic theory. It represents mathematical knowledge both declaratively and procedurally. Since the algorithms of algorithmic theories manipulate the s...

متن کامل

Biform Games

Both noncooperative and cooperative game theory have been applied to business strategy. We propose a hybrid noncooperative-cooperative game model, which we call a biform game. This is designed to formalize the notion of business strategy as making moves to try to shape the competitive environment in a favorable way. (The noncooperative component of a biform game models the strategic moves. The ...

متن کامل

A Universal Machine for Biform Theory Graphs

Broadly speaking, there are two kinds of semantics-aware assistant systems for mathematics: proof assistants express the semantic in logic and emphasize deduction, and computer algebra systems express the semantics in programming languages and emphasize computation. Combining the complementary strengths of both approaches while mending their complementary weaknesses has been an important goal o...

متن کامل

MathScheme: Project Description

The mission of mechanized mathematics is to develop software systems that support the process people use to create, explore, connect, and apply mathematics. Working mathematicians routinely leverage a powerful synergy between deduction and computation. The artificial division between (axiomatic) theorem proving systems and (algorithmic) computer algebra systems has broken this synergy. To signi...

متن کامل

Formalizing Mathematical Knowledge as a Biform Theory Graph: A Case Study

A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory graph is a network of theories connected by meaning-preserving theory morphisms that map the formulas of one theory to the formulas of another theory. Theory gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Manufacturing & Service Operations Management

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2005